An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)
نویسندگان
چکیده
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorithms can only work in binary dBG. In this paper, we investigate broadcasting in bidirectional dBG for a degree greater than or equal to two. A distributed broadcast algorithm for one-to-all broadcasting in the all port communication is proposed for dBG(d,k).
منابع مشابه
Efficient Routing and Broadcasting Algorithms in de Bruijn Networks
Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent. Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algorithms can only work in dBG(2,k). In this paper, we investigate ...
متن کاملConstruction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree
In the life sciences, determining the sequence of bio-molecules is essential step towards the understanding of their functions and interactions inside an organism. Powerful technologies allows to get huge quantities of short sequencing reads that need to be assemble to infer the complete target sequence. These constraints favour the use of a version de Bruijn Graph (DBG) dedicated to assembly. ...
متن کاملFault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into shortest path in failure mode in dBG has been nonexistent. In addition, as the size of the network increase,...
متن کاملBroadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks
We use simple compound properties of de Bruijn related networks to get new bounds about broadcasting and gossiping on such networks. We get some asymptotically optimal results on undi-rected de Bruijn, Kautz, and generalization of the shuue-exchange networks. Our techniques allow more generally to derive eecient broadcasting protocols for the undirected graph associated to a line digraph. As ex...
متن کاملNeighborhood Broadcasting in Undirected de Bruijn and Kautz Networks
This paper considers a neighborhood broadcasting protocol in undirected de Bruijn and Kautz networks. The neighborhood broadcasting problem(NBP) is the problem of disseminating a message from an originator vertex to only its neighbors. Our protocol works under the single-port and half-duplex model and solves NBP in 5 log2(n + 1) + O(1) time units on the undirected de Bruijn graph UB(n, d) with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004